Petr Andreevich Zaionchkovskii, 1904–1983

Petr Jančar FEI

1 RSA-cryptosystem, and the underlying theory The aim of this section is to recall the RSA cryptographic method and the necessary theory showing its correctness, computational complexity, etc. 1.1 Creating an RSA system RSA (Rivest, Shamir, Adleman) is a particular method which can be used for the public-key cryptography. A concrete RSA system is created as follows: 1. Choose randomly two diffe...

Petr Hájek , Tomáš Havránek

Part 3 Petr Jančar

(E.g. in [5], [3].) When we prove a (mathematical) assertion, the proof usually contains more information (and provides a deeper insight) than the plain fact that the assertion is true; this is also (usually) desirable. But there are contexts where a party, say Peggy [or Prover], should show to another party, say Victor [Verifier], that she has a secret piece of knowledge (like a password allow...

Petr Hájek: a scientific biography

Petr Hájek is a renowned Czech logician, whose record in mathematical logic spans half a century. His results leave a permanent imprint in all of his research areas, which can be roughly delimited as set theory, arithmetic, fuzzy logic and reasoning under uncertainty, and information retrieval; some of his results have enjoyed successful applications. He has, throughout his career, worked at th...

Articulation in Corpus Annotation Petr

The research group of theoretical and computational linguistics at Charles University, Prague, which owes so much to the interest and support of Walther von Hahn in the difficult decades, now works on the Prague Dependency Treebank (PDT), a collection of annotated sentences from the Czech National Corpus, based on the descriptive framework of Functional Generative Description (see Sgall et al. ...